Hyper-Zagreb indices of graphs and its applications
نویسندگان
چکیده
The first and second Hyper-Zagreb index of a connected graph $G$ is defined by $HM_{1}(G)=\sum_{uv \in E(G)}[d(u)+d(v)]^{2}$ $HM_{2}(G)=\sum_{uv E(G)}[d(u).d(v)]^{2}$. In this paper, the indices certain graphs are computed. Also bounds for determined. Further linear regression analysis degree based with boiling points benzenoid hydrocarbons carried out. model, on index, better than models corresponding to other distance indices.
منابع مشابه
Hyper Zagreb Indices and Its Coindices of Graphs
For a (molecular) graph, the hyper Zagreb index is defined as HM(G) = ∑ uv∈E(G) (dG(u) + dG(v)) 2 and the hyper Zagreb coindex is defined asHM(G) = ∑ uv/ ∈E(G) (dG(u)+dG(v)) 2. In this paper, the hyper Zagreb indices and its coindices of edge corona product graph, double graph and Mycielskian graph are obtained.
متن کاملZagreb, multiplicative Zagreb Indices and Coindices of graphs
Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The first, second and third Zagreb indices of G are respectivly defined by: $M_1(G)=sum_{uin V} d(u)^2, hspace {.1 cm} M_2(G)=sum_{uvin E} d(u).d(v)$ and $ M_3(G)=sum_{uvin E}| d(u)-d(v)| $ , where d(u) is the degree of vertex u in G and uv is an edge of G connecting the vertices u and v. Recently, the first and second m...
متن کاملThe Hyper-Zagreb Index of Trees and Unicyclic Graphs
Topological indices are widely used as mathematical tools to analyze different types of graphs emerged in a broad range of applications. The Hyper-Zagreb index (HM) is an important tool because it integrates the first two Zagreb indices. In this paper, we characterize the trees and unicyclic graphs with the first four and first eight greatest HM-value, respectively.
متن کاملOn leap Zagreb indices of graphs
The first and second Zagreb indices of a graph are equal, respectively, to the sum of squares of the vertex degrees, and the sum of the products of the degrees of pairs of adjacent vertices. We now consider analogous graph invariants, based on the second degrees of vertices (number of their second neighbors), called leap Zagreb indices. A number of their basic properties is established.
متن کاملLeap Zagreb indices of trees and unicyclic graphs
By d(v|G) and d_2(v|G) are denoted the number of first and second neighborsof the vertex v of the graph G. The first, second, and third leap Zagreb indicesof G are defined asLM_1(G) = sum_{v in V(G)} d_2(v|G)^2, LM_2(G) = sum_{uv in E(G)} d_2(u|G) d_2(v|G),and LM_3(G) = sum_{v in V(G)} d(v|G) d_2(v|G), respectively. In this paper, we generalizethe results of Naji et al. [Commun. Combin. Optim. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of algebra combinatorics discrete structures and applications
سال: 2021
ISSN: ['2148-838X']
DOI: https://doi.org/10.13069/jacodesmath.867532